A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow-shop scheduling problem (PFSP) with the minimizing makespan measure. The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles. In the first phase, t...
متن کاملA hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem
In this paper we propose PSO–EDA, a hybrid particle swarm optimization (PSO) with estimation of distribution algorithm (EDA) to solve permutation flowshop scheduling problem (PFSP). PFSP is an NP-complete problem, for which PSO was recently applied. The social cognition in the metaphor of canonical PSO is incomplete, since information conveyed in the non-gbest particles is lost. Also, the intel...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملEvolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems
The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for im...
متن کاملsolving flexible job-shop scheduling problem using hybrid algorithm based on gravitational search algorithm and particle swarm optimization
job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7311-9883